Secured distributed algorithms without hardness assumptions

We study algorithms in the LOCAL model that produce secured output. Specifically, each vertex computes its part output, entire output is correct, but cannot discover of other vertices, with a certain probability. As extensive research distributed field yielded efficient decentralized algorithms, discussion about security was somewhat neglected. Nevertheless, many protocols and were devised area secure multi-party computation problem. However, focus those to work for every function f at expense increasing round complexity, or necessity several computational assumptions. present novel approach, which identifies develops are inherently (which means they do not require any further constructions). This approach yields various labeling decomposition problems without requiring hardness assumption, only private randomness generator vertex.